Optimal Solution Research Articles

Accurate identification and confidence evaluation of automatic generation control command execution effect based on deep learning fusion model

With the increasing complexity of the power grid, the precision of the thermal power units' execution of automatic generation control (AGC) commands is gradually increasing the impact on the online regulation of the power grid. The deviation between the actual output of thermal power units and the AGC command of the grid will not only affect the consumption of new energy output, but also endanger the safe operation of the grid. This paper introduces “deep learning” technology to solve the problem. Firstly, an AGC command execution effect identification and confidence evaluation algorithm (ACEEI-CEA) is proposed. The algorithm builds a neural network model to accurately predict the unit output and the confidence evaluation of the prediction results. Next, a high-dimensional input preprocessing strategy based on variational autoencoder (VAE) is proposed to reduce the dimensionality of the model input attributes, improving the convergence and accuracy of the model. Finally, an AGC optimal command fast inversion solution method (AOCFISM) is designed. This method transforms the unit output deviation problem into an objective optimisation problem. And improve the efficiency of solving the optimal AGC command value by constraining the unit command value. The calculation results show that the error of the prediction results of the model proposed in this paper is 5% lower than that of the traditional neural network. The difference between the output value of the optimal AGC command and the expected output value obtained is less than 0.5 MV, which can support AGC online decision-making.© 2017 Elsevier Inc. All rights reserved.

Deep Learning-Assisted Online Task Offloading for Latency Minimization in Heterogeneous Mobile Edge

With the proliferation of smart devices in recent years, many applications requiring high computing capability and low latency have emerged. Edge computing is one of the promising paradigms to support such applications. Due to the high volatility of edge environments, e.g., frequent movements of mobile devices, varying task sizes, and time-variant channel conditions, we have to make the offloading and resource management decisions on the fly. This paper formulates and studies the problem of online task offloading and resource management in heterogeneous mobile edge environments. The goal of the problem is to minimize the overall system latency. We prove that the problem is NP-hard. Moreover, traditional algorithms needing long decision-making times are insufficient to support applications with high volatility. This paper proposes a deep learning-assisted online algorithm that can make fast decisions. In particular, we design an offline solver for the proposed problem and use a deep neural network to emulate the solver. We conduct extensive simulations to evaluate the proposed approach. Results show that the proposed approach is around <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$50,000\times$</tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$500\times$</tex-math></inline-formula> faster than the commercial Gurobi solver for the optimal solution and the proposed offline approximation solver, respectively. Moreover, the overall latency under the proposed approach is near-optimal.

Distributed Optimal Solutions for Multiagent Pursuit-Evasion Games for Capture and Formation Control

In this paper, distributed optimal solutions are designed for networked multiagent pursuit-evasion (MPE) games for capture and formation control. In the games, the pursuers aim to minimize the distance from their target evaders while the evaders attempt to maximize it, and at the same time, all players desire to maintain cohesion with their teammates. The goals of agents are obviously reflected in the obtained optimal control strategies which consist of an attracting term and/or a repelling term. Nash equilibrium is obtained by means of optimal strategies using the solutions of the HJI equations. Furthermore, three scenarios are considered in the MPE game: one-pursuer-one-evader, multiple-pursuer-one-evader, and multiple-pursuer-multiple-evader, where sufficient conditions are given for pursuers in achieving exponential capture or formation control with ultimate zero or bounded errors. It is shown that the conditions depend on the structure of the communication graph, the parameters in the controllers, and the expected formation configurations. Finally, both simulations and real flight experiments successfully demonstrate the effectiveness of the proposed strategies.

Adaptive fuzzy weighted C-mean image segmentation algorithm combining a new distance metric and prior entropy

The fuzzy C-mean clustering algorithm (FCM) is effective in image segmentation. However, its sensitivity to initialization settings and the limitation of the Euclidean distance metric in measuring similarity lead to unsatisfactory image segmentation. To overcome these shortcomings, we propose an adaptive fuzzy weighted C-mean image segmentation algorithm that combines a new distance metric and prior entropy. This algorithm significantly contributes in three aspects. First, we employ an improved sparse subspace clustering (SSC) algorithm based on the superpixel image for initialization settings. This step aims to obtain the initial number of clusters and the membership matrix, ensuring the algorithm’s convergence to the optimal solution. Second, to better capture differences between image regions, we introduce a novel distance metric that combines Euclidean and non-Euclidean distances. Simultaneously, the fuzzy weight is introduced to mitigate redundant feature interference, making the clustering result more reasonable. Finally, leveraging prior entropy – a maximum entropy under conditional constraints – we refine the algorithm’s adaptability to unknown features, thereby improving clustering accuracy. Comparative experiments with several state-of-the-art algorithms validate the effectiveness and robustness of our proposed algorithm.

Linearization Method for Large-Scale Hydro-Thermal Security-Constrained Unit Commitment

Security-constrained unit commitment (SCUC) is one of the most fundamental optimization problems in power systems. The objective of SCUC is to minimize the operating cost while respecting both system-wide and generator-specific constraints. It leads to a large-scale and mixed-integer programming (MIP) model with a large number of binary decision variables which is difficult to solve. This paper, based on the convex hull theory of single-unit, proposes a linearization method for the hydro-thermal SCUC problem with decoupled thermal units and variable-head hydro units. Then, the strategy of embedding two types of convex hulls in a multi-unit commitment and the heuristic method of constructing a feasible solution are designed, by which the multi-UC is approximated from large-scale mixed-integer programming to linear programming that can be solved in polynomial time. Finally, we theoretically prove that the optimal solution of the proposed LP model is always better than that of the Lagrangian Relaxation model. Numerical experiments on several large-scale test systems demonstrate the effectiveness and efficiency of the proposed method. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This paper proposes a linear programming model for the SCUC problem by lifting up to a higher-dimensional space. It realizes an important innovation in reducing the computational complexity of SCUC from the perspective of linearization. The proposed method can be well applied to large-scale long-term unit commitment problems. To better use this method, the following two properties should be highlighted: 1) the error of the proposed method is less than the Lagrangian relaxation method and decreases with the increasing system scales and 2) the computational efficiency of the proposed method is 10-100 times faster than that of the MIP model. We have tested many practical power systems and find that the error of the proposed LP model is usually very small compared with the precise MIP while the computational performance is significantly improved. In some practical cases, the decision makers usually do not want to find the precise optimal solution while only an approximation under a fast speed, because the boundary condition is imprecise. The proposed method is useful. Besides, for the cases that need the precise optimal solution, the proposed method can provide a high-quality initial solution for the MIP model to accelerate the convergence.

Distributed Multi-Area Intraday Economic Dispatch Using Modified Critical Region Projection Algorithm

Convergence acceleration is always a critical issue in distributed multi-area scheduling. The critical region projection (CRP) algorithm based on multi-parametric quadratic programming (MPQP) shows better convergence performance for multi-area static economic dispatch. However, its imperfect decomposition framework cannot be directly applied to dynamic economic dispatch. Therefore, this paper modifies the CRP algorithm to achieve fast distributed multi-area intra-day economic dispatch (MAIDED). First, we introduce slack variables to each area and add the corresponding penalty term into their objective functions to present a primal decomposition framework with penalty relaxation. It is more realistic than the decomposition framework of traditional CRP (TCRP). Then, an iterative algorithm of double spatial scale search (DSSS) is developed to improve the convergence rate of distributed solving based on the similar optimal value function in adjacent critical regions (CRs). Moreover, we design an initial value selection method based on data fitting to further reduce the number of iterations. Finally, three interconnected power systems of different sizes are used for numerical testing to demonstrate that the proposed modified CRP (MCRP) algorithm can meet the practical application and has higher convergence efficiency. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This paper is motivated by the problem of distributed MAIDED for power systems but it also applies to other multi-agent networks with a coordinator. The convergence speed of the existing distributed optimization algorithm is slow, which increases the risk of communication failure and attack. Meanwhile, more iterations will result in increased communication and computing costs. This paper modified the TCRP algorithm for high-efficient distributed MAIDED. The penalty relaxation is used to ensure that the decomposition framework is consistent with the actual system operation. The DSSS algorithm and the initial value selection method based on data fitting are designed to effectively reduce the number of iterations. In this paper, the DSSS is that the coordinator enlarges the CRs uploaded from each area to perform a rough optimization for approaching the global optimal solution fast, and then in the next iteration, conducts a precise optimization like the TCRP algorithm to determine the precise optimal solution. The numerical testing of the interconnected power systems of different sizes indicates that the MCRP algorithm has fewer iterations and calculation times than the TCRP algorithm. Future work will extend the MCRP algorithm to solve the distributed multi-area unit commitment problem.

Tradeoff Between Age of Information and Operation Time for UAV Sensing Over Multi-Cell Cellular Networks

Unmanned aerial vehicles (UAVs) have a significant potential for sensing applications in further cellular networks due to their extensive coverage and flexible deployment. In this paper, we consider a multi-cell cellular network with a cellular-connected UAV, which senses data with onboard sensors and uploads sensory data to the ground base stations (BSs). To evaluate the freshness of sensory data, we employ the concept of age of information (AoI), which is defined as the time elapsed since the latest successful transmission of sensory data. A lower AoI implies fresher sensory data, which may lead to the increase of UAV operation time. To balance such tradeoff, we aim to minimize the weighted sum of operation time and total AoI for the UAV by jointly optimizing transmission scheduling, BS association, as well as UAV trajectory. The problem is formulated as a mixed-integer nonlinear programming (MINLP) problem, which is difficult to solve due to the time-varying propagation channels. To this end, we first characterize the average communication performance with statistic channel information, and then develop a search algorithm to obtain the optimal solution via employing the optimal structure as well as convex optimization techniques, while a low-complexity Double Graph based Algorithm (DGA) is developed to obtain a suboptimal solution. Then, by taking into account the site-specific performance and making fast decisions online, we propose a Deep reinforcement Learning Algorithm (DLA). Compared to DGA, DLA can adapt to the specific local environment and obtain a solution more rapidly once the training process is completed. Simulation results show that the proposed algorithms outperform the benchmarks about 30%, and achieve flexible tradeoff between operation time and AoI of UAV sensing, which is not available by considering just one objective.

Data-Driven Linear Quadratic Optimization for Controller Synthesis With Structural Constraints.

For various typical cases and situations where the formulation results in an optimal control problem, the linear quadratic regulator (LQR) approach and its variants continue to be highly attractive. In certain scenarios, it can happen that some prescribed structural constraints on the gain matrix would arise. Consequently then, the algebraic Riccati equation (ARE) is no longer applicable in a straightforward way to obtain the optimal solution. This work presents a rather effective alternative optimization approach based on gradient projection. The utilized gradient is obtained through a data-driven methodology, and then projected onto applicable constrained hyperplanes. Essentially, this projection gradient determines a direction of progression and computation for the gain matrix update with a decreasing functional cost; and then the gain matrix is further refined in an iterative framework. With this formulation, a data-driven optimization algorithm is summarized for controller synthesis with structural constraints. This data-driven approach has the key advantage that it avoids the necessity of precise modeling which is always required in the classical model-based counterpart; and thus the approach can additionally accommodate various model uncertainties. Illustrative examples are also provided in the work to validate the theoretical results.

A study on the solution of interval linear fractional programming problem

Interval linear fractional programming problem (ILFPP) approaches uncertain-ties in real-world systems such as business, manufacturing, finance, and eco-nomics. In this study, we propose solving the interval linear fractional pro-gramming (ILFP) problem using interval arithmetic. Further, to construct the problem, a suitable variable transformation is used to form an equivalent ILP problem, and a new algorithm is depicted to obtain the optimal solution with-out converting the problem into its conventional form. This paper compares the range, solutions, and approaches of ILFP with fuzzy linear fractional pro-gramming (FLFP) in solving real-world optimization problems. The illustrated numerical examples show a better range of interval solutions on practical appli-cations of ILFPs and uncertain parameters.

Motion Planning and Control of Autonomous Aggressive Vehicle Maneuvers

Aggressive vehicle maneuvers such as those performed by professional racing drivers achieve high agility motion at the edge of handling limits. These aggressive maneuvers can be used to design human-inspired active safety features for next-generation “accident-free” vehicles. We present a motion planning and control design for autonomous aggressive vehicle maneuvers. The motion planner takes advantages of the sparse stable trees and the enhanced rapidly exploring random tree (RRT*) algorithms. The use of the sparsity property helps to reduce the computational cost of the RRT* method by removing non-useful nodes in each iteration and therefore to rapidly converge to the optimal solution. The proposed motion control design allows the vehicle to operate outside the stability region to accomplish a safe, agile maneuver. A safety region is computed to augment the stability region and the motion control is built on a modified nonlinear model predictive control method. We implement the proposed planner and controller and demonstrate the autonomous aggressive maneuvers on a 1/7-scale racing vehicle platform. Comparison with human expert driver and other existing methods is also presented to demonstrate the performance and robustness. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —Motion planning and control of human driver-inspired aggressive vehicle maneuvers is a challenging task because of high-agility, unstable fast vehicle motions. This paper is motivated by addressing this challenge in autonomous driving technologies. Instead of restricting vehicle motions within a stability region that is taken by existing methods, we augment the conservative stability region to a safety region with guaranteed performance. To improve the computational efficiency of sampling-based motion planners, we take advantage of sparsity and also integration of a nonlinear predictive control method to compute feasible vehicle motion in searching space. The stability of the vehicle motion controller and sub-optimality of the motion planner are analyzed and guaranteed. Using a scaled vehicle testbed, we validate and compare the proposed motion planning and control design with other existing methods and human expert driver. The experimental results demonstrate the superior performance than the other methods and comparable with human expert driving skills.

Grouped Multivariate Variational Mode Decomposition With Application to EEG Analysis.

In this paper, a novel extended form of multivariate variational mode decomposition (MVMD) method to multigroup data named as grouped MVMD (GMVMD) is proposed. GMVMD is distinct from MVMD as it extracts common frequencies with strong correlations among regional channels. Firstly, GMVMD utilizes a new clustering algorithm named as frequencies grouping algorithm to classify the nearest common frequencies among all channels to specified groups. Secondly, a generic variational optimization model which is extended from MVMD is formulated. Thirdly, alternating direction method of multipliers (ADMM) is utilized to obtain optimal solution of GMVMD model. The proposed method introduces an extra parameter to decide the number of clusterings which need to be specified by the user. The effectiveness and superiority of the algorithm are demonstrated on a series of experiments. The utility of GMVMD is verified by grouping real-world electroencephalogram (EEG) data having similar center frequencies successfully. GMVMD outperforms MVMD in mode-alignment, signal reduction error and et al. Significance: GMVMD can obtain more accurate center frequencies and less signal reduction error than MVMD.

Fast Multilabel Feature Selection via Global Relevance and Redundancy Optimization.

Information theoretical-based methods have attracted a great attention in recent years and gained promising results for multilabel feature selection (MLFS). Nevertheless, most of the existing methods consider a heuristic way to the grid search of important features, and they may also suffer from the issue of fully utilizing labeling information. Thus, they are probable to deliver a suboptimal result with heavy computational burden. In this article, we propose a general optimization framework global relevance and redundancy optimization (GRRO) to solve the learning problem. The main technical contribution in GRRO is a formulation for MLFS while feature relevance, label relevance (i.e., label correlation), and feature redundancy are taken into account, which can avoid repetitive entropy calculations to obtain a global optimal solution efficiently. To further improve the efficiency, we extend GRRO to filter out inessential labels and features, thus facilitating fast MLFS. We call the extension as GRROfast, in which the key insights are twofold: 1) promising labels and related relevant features are investigated to reduce ineffective calculations in terms of features, even labels and 2) the framework of GRRO is reconstructed to generate the optimal result with an ensemble. Moreover, our proposed algorithms have an excellent mechanism for exploiting the inherent properties of multilabel data; specifically, we provide a formulation to enhance the proposal with label-specific features. Extensive experiments clearly reveal the effectiveness and efficiency of our proposed algorithms.

Impact of Assimilation of the Tropical Cyclone Strong Winds Observed by Synthetic Aperture Radar on Analyses and Forecasts

Abstract A few high-wind observations have been obtained from satellites over the ocean around tropical cyclones (TCs), but the impact of data assimilation of such observations over the sea on forecasting has not been clear. The spaceborne synthetic aperture radar (SAR) provides high-resolution and wide-area ocean surface wind speed data around the center of a TC. In this study, the impact of data assimilation of the ocean surface wind speed of SAR (OWSAR) on regional model forecasts was investigated. The assimilated data were estimated from SAR on board Sentinel-1 and RADARSAT-2. The bias of OWSAR depends on wind speed, the observation error variance depends on wind speed and incidence angle, and the spatial observation error correlation depends on the incidence angle. The observed OWSAR is screened using the variational quality control method with the Huber norm. In the case of Typhoon Hagibis (2019), OWSAR assimilation modified the TC low-level inflow, which also modified the TC upper-level outflow. The propagation of this OWSAR assimilation effect from the surface to the upper troposphere was given by a four-dimensional variational method that searches for the optimal solution within strong constraints on the time evolution of the forecast model. Statistical validation confirmed that errors in the TC intensity forecast decreased over lead times of 15 h, but this was not statistically significant. The validation using wind profiler observations showed that OWSAR assimilation significantly improved the accuracy of wind speed predictions from the middle to the upper level of the troposphere. Significance Statement The purpose of this study was to demonstrate the impact of the assimilation of ocean surface wind speed by synthetic aperture radar (SAR) on regional model predictions. In the case of tropical cyclones, ocean surface wind speed assimilation modified inflows in the lower layer and outflows in the upper layer. The results indicate that the SAR assimilation improves the accuracy of wind speed forecasts in the middle to upper troposphere.

Improved Evolutionary Operators for Sparse Large-Scale Multiobjective Optimization Problems

Many critical science, societal, and engineering fields contain large-scale multiobjective optimization problems (LSMOPs), comprised of many decision variables. However, as the number of decision variables increases, optimization algorithms face exponentially large search spaces, thereby exhibiting a degraded performance. Nonetheless, LSMOPs whose optimal solutions correspond to sparse variable vectors can be solved more efficiently by evolutionary multiobjective optimization (EMO) algorithms. Despite the great recent strides in developing generic EMO algorithms for sparse LSMOPs, there is still room for improvement. Specifically, algorithms still struggle to find convergent and diverse Pareto fronts in an acceptable amount of time when solving sparse LSMOPs with thousands of decision variables. To better solve sparse LSMOPs, we propose a novel set of evolutionary operators to adapt small-scale EMO algorithms for sparse LSMOPs. These simple, novel, and effective operators include varied striped sparse population sampling (VSSPS), sparse simulated binary crossover (S-SBX), and sparse polynomial mutation (S-PM). These operators, combined with NSGA-II, make the proposed S-NSGA-II algorithm. S-NSGA-II runs near-universally faster than existing methods for problems containing up to 6,400 decision variables, while performing as well as or better than contemporary sparse LSMOP algorithms with respect to hypervolume, especially with problems with larger than 5,000 decision variables.

Optimal Tracking Control of Heterogeneous MASs Using Event-Driven Adaptive Observer and Reinforcement Learning.

This article considers the output tracking control problem of nonidentical linear multiagent systems (MASs) using a model-free reinforcement learning (RL) algorithm, where partial followers have no prior knowledge of the leader's information. To lower the communication and computing burden among agents, an event-driven adaptive distributed observer is proposed to predict the leader's system matrix and state, which consists of the estimated value of relative states governed by an edge-based predictor. Meanwhile, the integral input-based triggering condition is exploited to decide whether to transmit its private control input to its neighbors. Then, an RL-based state feedback controller for each agent is developed to solve the output tracking control problem, which is further converted into the optimal control problem by introducing a discounted performance function. Inhomogeneous algebraic Riccati equations (AREs) are derived to obtain the optimal solution of AREs. An off-policy RL algorithm is used to learn the solution of inhomogeneous AREs online without requiring any knowledge of the system dynamics. Rigorous analysis shows that under the proposed event-driven adaptive observer mechanism and RL algorithm, all followers are able to synchronize the leader's output asymptotically. Finally, a numerical simulation is demonstrated to verify the proposed approach in theory.

Electronic governance in EU member states and candidate countries (using the exampleS of Poland and Ukraine): comparative legal analysis

The article addresses the issue of further improvement and development of Electronic Governance in Ukraine through the analysis of experience gained by various countries. It has been established that Electronic Governance currently plays a pivotal role in the development of society, which necessitates the need for superior and effective improvement of this sphere to ensure the maximum level of its development and support for society. Comprehensive utilization of information technology is the main mechanism in achieving this goal, as it can meet the needs of society at the highest level. However, the further development and improvement of Electronic Governance in Ukraine is currently hindered by the conditions in which the country has found itself due to the war. These conditions necessitate the search for fundamentally new solutions and approaches related to the most effective use of information resources, and the provision of effective, efficient and high-quality support and assistance for society. Efforts are currently focused on finding the optimal solution for the operation, improvement and future effective development of Electronic Governance. For Ukraine, this is the path it must travel from the idea of transformational changes in the field of information technology and resources to the gradual alignment of Electronic Governance with European standards. This path involves declaring this direction as a top priority at the highest level. The introduction of Electronic Governance as a form of organization of public administration began in Ukraine a few years ago, and has been gaining increasing public support.Analysis of the main foreign initiatives and practices in this regard provides evidence of an above-average level of development of Electronic Governance in the countries of the European Union and other states, which enables the rapid and efficient fulfilment of public needs. At the same time, it has been established that the most effective (in the context of improving electronic governance) has been Poland, which has already fully established its Electronic Government, operating efficiently and providing various electronic services to society. This system is transparent, flexible and convenient. It allows users to save time and avoid unnecessary bureaucratic procedures, and society now has easier access to the necessary information. It has been established that improving Electronic Governance in Ukraine by drawing on Poland’s experience in this regard has the potential to modernize public administration and, on a practical level, provide more opportunities for direct access to information. This will allow for the implementation of new initiatives, including the digitalization of the country, democratization of society, and achieving goals of sustainable development.

Optimising O&M scheduling in offshore wind farms considering weather forecast uncertainty and wake losses

Offshore wind farms, while strategically positioned to maximise wind energy capture, are exposed to harsh environments, impacting their reliability and accessibility. Low reliability and accessibility in turn translate into high Operation and Maintenance (O&M) costs, which represent approximately 30% of the total lifetime costs of the project. One approach to reduce O&M costs is to improve maintenance planning decisions. The present paper presents a novel O&M scheduling methodology for offshore wind farm operations based on wind and wave forecasts. The methodology forecasts farm yield considering farm wake effects to identify optimal operation schedules, vessel routing, and turbine maintenance sequences that minimise costs and revenue losses due to downtime. Weather forecast uncertainty is modelled and integrated into the decision-making process to minimise weather risks. A case study inspired by the WindFloat Atlantic floating wind project was used to demonstrate the optimisation potential. Results suggest that adopting the proposed methodology over business-as-usual scheduling significantly boosts offshore wind farm operational profits during the forecasted period, with increases ranging from 2% to 24%, depending on the scenario considered. It was found that integrating the wind farm wake losses into the scheduling decisions can improve the optimal scheduling solution and further minimise total operation costs.

Damage Detection in Structural Health Monitoring Using an Integrated ANNIRSA Approach

In the past decade, artificial neural networks (ANNs) have been widely employed to address many problems. Despite their powerful problem-solving capabilities, ANNs are susceptible to a significant risk of stagnation in local minima due to using backpropagation algorithms based on gradient descent (GD) for optimal solution searching. In this paper, we introduce an enhanced version of the reptile search algorithm (IRSA), which operates in conjunction with an ANN to mitigate these limitations. By substituting GD with IRSA within an ANN, the network gains the ability to escape local minima, leading to improved prediction outcomes. To demonstrate the efficacy of IRSA in enhancing ANN’s performance, a numerical model of the Nam O Bridge is utilized. This model is updated to closely reflect actual structural conditions. Consequently, damage scenarios for single-element and multielement damage within the bridge structure are developed. The results confirm that ANNIRSA offers greater accuracy than traditional ANNs and ANNRSAs in predicting structural damage.

Comparison of cooling grey solutions in the sense-city urban demonstrator for adapting cities to heat waves

SummaryFaced with the increase in urban heat in summer, cities must quickly adapt by offering cool islands. If nature-based solutions are efficient and popular, other so-called grey solutions exist and can also provide solutions. In this paper we compare standard grey solutions in Sense-city, an urban demonstrator equipped with sensor, located in the scientific campus of Cité Descartes at Marne la Vallée. Our objective is on the one hand to compare the effectiveness of standard solutions over time, but also to study the ability of sense-city and its canyon street to study this phenomenon despite its relatively small size. MethodsIn this work we follow an experimental approach using a wide coverage of calibrated sensors deployed in Sense-city. We have conducted two measurement campaigns in July 2021 and July–August 2022 where we study the effectiveness of standard solutions (shading, white floor surface, street watering) to reduce the air temperature in the canyon street of sense-city. As the days are different, we compare the temperature difference in the street canyon equipped with these cooling solutions with that on the surrounding area. This method allows us to overcome daily variations. To interpret the results, we analyse the shades and we follow the temperature over time and not only during the hottest hours. We also calculate the UTCI (Universal Thermal Climate Index) to compare the perceived temperature. FindingsThe results show that despite its small size, the canyon street of sense-city behaves like a canyon street and that the measured temperature differences due to heat exchanges comply with physical laws and that the number and spatial distribution of sensors is validated. The Sense-city demonstrator can therefore be used to carry out thermal efficiency experiments. In addition, the method we used to compare cooling solutions allows us to limit the impacts due to slight daily variations. Finally, while watering is effective in rapidly lowering the temperature in the street, shading remains an optimal solution for the perceived temperature, even if it would be ideal to close them at the end of the day to allow air circulation.

Modulating ultrafast carrier dynamics behavior via vacancy engineering of ReSe2 with Se vacancy for efficient electrochemical activity

Vacancy engineering is powerful for manipulating material properties. Selenium vacancies (VSe) exert significantly impact on the physicochemical properties of rhenium diselenide (ReSe2), triggering applications in catalysis and photoelectric devices. However, the effects on electronic structure, carrier lifetime, and electrochemical activity are inadequately explored and poorly elucidated. Herein, hydrothermal-controlled growth of ReSe2 with VSe is synthesized by different strategies. The ethanol-assisted hydrothermal method can adjust VSe concentration of ReSe2 on carbon paper by time parameters. Mediated excitonic effects were characterized in the transient absorption spectroscopy and photoluminescence of VSe-regulated ReSe2. The defect level produces unique defect emission peak, and the VSe-mediated exciton dynamics problem was discussed. The transient absorption result shows that high VSe concentration can optimize carrier lifetime, carrier separation efficiency, and electron utilization. The electrocatalytic hydrogen evolution reaction of ReSe2 catalyst revealed the electrochemical activity regulation by VSe concentration, which provides ideas for enhancing catalyst performance. Density functional theory result confirms the role of selenium vacancies in the regulation of the electronic structure of ReSe2. This work proffers an optimal solution strategy for hydrothermal preparation of ReSe2, and demonstrates the feasibility of regulating electrochemical activity by vacancy engineering. The excellent performance is beneficial for water cracking and physical devices.